A Study of Fractional-Order Memristive Ant Colony Algorithm: Take Fracmemristor into Swarm Intelligent Algorithm

نویسندگان

چکیده

As the fourth fundamental circuit element, memristor may execute computations while storing data. Fracmemristor takes advantage of fractional calculate’s long-term memory, non-locality, weak singularity, and memristor’s storage–computational integration. Since physical structure fracmemristor is similar to topology ant transfer probability flow in ACO, we propose fractional-order memristive colony algorithm (FMAC), which uses system record probabilistic information nodes that will crawl through future pass it current node ant, so acquires ability predict transfer. After instigating optimization capabilities with TSP, discovered FMAC superior PACO-3opt, best integer-order currently available. operates substantially more quickly than due prediction module based on (FACA).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MC-ANT: A Multi-Colony Ant Algorithm

In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between colonies and a mutation operator that aims to adjust the parameter settings during the optimization. The proposed method was applied to several benchmark instances...

متن کامل

Generic Cabling of Intelligent Buildings Based on Ant Colony Algorithm

Generic cabling is a key component for multiplex cable wiring. It is one of the basic foundations of intelligent buildings. Using operation flow in generic cabling, the index constraints affecting generic cabling have been evolved in this paper. A mathematical model is built based on the ant colony algorithm with multiple constraints, and improvements were made on the original basis to extend t...

متن کامل

Multi-Colony Ant Algorithm

The first ant colony optimization (ACO) called ant system was inspired through studying of the behavior of ants in 1991 by Macro Dorigo and co-workers [1]. An ant colony is highly organized, in which one interacting with others through pheromone in perfect harmony. Optimization problems can be solved through simulating ant’s behaviors. Since the first ant system algorithm was proposed, there is...

متن کامل

Ant Colony Optimization Algorithm

Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.

متن کامل

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fractal and fractional

سال: 2023

ISSN: ['2504-3110']

DOI: https://doi.org/10.3390/fractalfract7030211